Comparison Principle for a Generalized Fast Marching Method

نویسنده

  • Nicolas Forcadel
چکیده

In [4], the authors have proposed a generalization of the classical Fast Marching Method of Sethian for the eikonal equation in the case where the normal velocity depends on space and time and can change sign. The goal of this paper is to propose a modified version of the Generalized Fast Marching Method proposed in [4] for which we state a general comparison principle. We also prove the convergence of the new algorithm. AMS Classification: 65M06, 65M12, 49L25 .

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A variational formulation of the fast marching eikonal solver

I exploit the theoretical link between the eikonal equation and Fermat’s principle to derive a variational interpretation of the recently developed method for fast traveltime computations. This method, known as fast marching, possesses remarkable computational properties. Based originally on the eikonal equation, it can be derived equally well from Fermat’s principle. The new variational formul...

متن کامل

Remarks on the O(N) Implementation of the Fast Marching Method

The fast marching algorithm computes an approximate solution to the eikonal equation in O(N logN) time, where the factor logN is due to the administration of a priority queue. Recently, [YBS06] have suggested to use an untidy priority queue, reducing the overall complexity to O(N) at the price of a small error in the computed solution. In this paper, we give an explicit estimate of the error in...

متن کامل

Implementation of the Fast Marching Method

The fast marching algorithm computes an approximate solution to the eikonal equation in O(N logN) time, where the factor logN is due to the administration of a priority queue. Recently, [YBS06] have suggested to use an untidy priority queue, reducing the overall complexity to O(N) at the price of a small error in the computed solution. In this paper, we give an explicit estimate of the error in...

متن کامل

A Generalized Fast Marching Method for Dislocation Dynamics

In this paper, we consider a Generalized Fast Marching Method (GFMM) as a numerical method to compute dislocation dynamics. The dynamics of a dislocation hyper-surface in R (with N = 2 for physical applications) is given by its normal velocity which is a non-local function of the whole shape of the hyper-surface itself. For this dynamics, we show a convergence result of the GFMM as the mesh siz...

متن کامل

FEM-like Fast Marching Method for the Computation of the Boat-Sail Distance and the Associated Voronoi Diagram

A new concept called a boat-sail distance is introduced on the surface of water with flow, and it is used to define a generalized Voronoi diagram, in such a way that the water surface is partitioned into regions belonging to the nearest harbors with respect to this distance. The problem of computing this Voronoi diagram is reduced to a boundary value problem of a partial differential equation, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • SIAM J. Numerical Analysis

دوره 47  شماره 

صفحات  -

تاریخ انتشار 2009